A problem on algebraic graph theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Graph Theory

Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investigation of the relation between properties of a graph and the spectrum of its adjacency matrix. A ce...

متن کامل

Algebraic Graph Theory

Simeon Ball, Universitat Politécnica de Catalunya On subsets of a finite vector space in which every subset of basis size is a basis In this talk we consider sets of vectors S of the vector space Fq with the property that every subset of S of size k is a basis. The classical example of such a set is the following. Example (Normal Rational Curve) The set S = {(1, t, t, . . . , tk−1) | t ∈ Fq} ∪ ...

متن کامل

On a problem in extremal graph theory

The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...

متن کامل

Invariance in Algebraic Graph Theory

Let X > √ 2 be arbitrary. Is it possible to study right-reversible, integrable categories? We show that Q is larger than â. Unfortunately, we cannot assume that I (Γ) = |I|. Therefore the goal of the present paper is to derive linearly anti-maximal curves.

متن کامل

Algebraic Graph Theory Without Orientation

Let G be an undirected graph with vertices {v1, v2, . . . , vν} and edges {e1, e2, . . . , eε}. Let M be the ν× ε matrix whose ijth entry is 1 if ej is a link incident with vi, 2 if ej is a loop at vi, and 0 otherwise. The matrix obtained by orienting the edges of a loopless graph G (i.e., changing one of the 1s to a −1 in each column of M) has been studied extensively in the literature. The pu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1985

ISSN: 0012-365X

DOI: 10.1016/0012-365x(85)90067-6